Interactive Editing of Voxel-Based Signed Distance Fields
نویسندگان
چکیده
Signed distance functions computed in discrete form from given RGB-D data as regular voxel grids can represent manifold shapes the zero crossing of a trivariate function; corresponding meshes be derived by Marching Cubes algorithm. However, 3D models automatically reconstructed this way often contain irrelevant objects or artifacts, such holes noise, due to erroneous scan and error-prone reconstruction processes. This paper presents an approach for interactive editing signed functions, grids, that enables manual refinement enhancement geometry. To end, we combine concepts known constructive solid geometry, where complex are created simple base shapes, with voxel-based representation geometry real-world scans. Our implemented entirely on GPU enable real-time interaction. Further, present how implement high-level operators, copy, move, unification.
منابع مشابه
Signed Lp-distance fields
We introduce and study a family of generalized double-layer potentials which are used to build smooth and accurate approximants for the signed distance function. Given a surface, the value of an approximant at a given point is a power mean of distances from the point to the surface points parameterized by the angle they are viewed from the given point. We analyze mathematical properties of the ...
متن کاملTruncated Signed Distance Fields
This thesis is concerned with topics related to dense mapping of large scale three-dimensional spaces. In particular, the motivating scenario of this work is one in which a mobile robot with limited computational resources explores an unknown environment using a depth-camera. To this end, low-level topics such as sensor noise, map representation, interpolation, bit-rates, compression are invest...
متن کاملInteractive Ray-tracing Based on OptiX to Visualize Signed Distance Fields
We propose a parallel ray-tracing technique to visualize signed distance fields generated from triangular meshes based on NVIDIA OptiX. Our method visualizes signed distance fields with various distance offset values at interactive rates (2–12 fps). Our method utilizes a parallel kd-tree implementation to query the nearest triangle and the sphere tracing method to visualize the implicit surface.
متن کاملPiecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient access to distance (error) estimates. In this paper we present an algorithm to compute a piecewise linear, not necessarily continuous approximation of the signed distance field for a given object. Our approach is based on...
متن کاملRegularisation of 3D Signed Distance Fields
Signed 3D distance fields are used a in a variety of domains. From shape modelling to surface registration. They are typically computed based on sampled point sets. If the input point set contains holes, the behaviour of the zero-level surface of the distance field is not well defined. In this paper, a novel regularisation approach is described. It is based on an energy formulation, where both ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of WSCG
سال: 2022
ISSN: ['1213-6980', '1213-6964', '1213-6972']
DOI: https://doi.org/10.24132/jwscg.2022.9